Total dominating set based algorithm for connected dominating set in Ad hoc wireless networks

In an efficient design of routing protocols in ad hoc wireless networks, the connected dominating set (CDS) is widely used as a virtual backbone. To construct the CDS with its size as minimum, many heuristic, meta-heuristic, greedy, approximation and distributed algorithmic approaches have been proposed in the recent years. These approaches mostly concentrated on deriving independent set and then constructing the CDS using Steiner tree and also these algorithms perform well only for the graphs having smaller number of nodes and also for the networks that are generated in an one fixed 2D simulation area. This paper provides a novel approach for constructing the CDS, based on the concept of total dominating set and bipartite theory of graphs. Since the total dominating set is the best lower bound for the CDS, the proposed approach reduces the computational complexity to construct the CDS through the number of iterations. Moreover the conducted simulation reveals that the proposed approach finds better solution than the recently developed approaches when all the three important factors of ad hoc network such as number of nodes, transmission radio range and area of network density varies. Key–Words: connected dominating set, total dominating set, adhoc, algorithms.